An (3, 3)-Visual Secret Sharing Scheme for Hiding Three Secret Data
نویسندگان
چکیده
Visual cryptography is one kind of image encrypting. It is different from traditional cryptography, because it does not need complex computation to decrypt. In current technology, most of visual cryptography are embedded a secret using two shares is limited. This paper proposes a new approach of (3, 3)visual secret sharing scheme to embed more information and have more secure than traditional visual cryptography.
منابع مشابه
Recursive Information Hiding in Visual Cryptography
Visual Cryptography is a secret sharing scheme that uses the human visual system to perform computations. This paper presents a recursive hiding scheme for 3 out of 5 secret sharing. The idea used is to hide smaller secrets in the shares of a larger secret without an expansion in the size of the latter.
متن کاملAn information hiding technique based on visual cryptography
Visual Cryptography was first proposed by Moni Naor and Adi Shamir in Eurocrypt’94. They demonstrated a (t, n) visual secret sharing scheme, in which visual information is encoded into n shares so that only someone with t or more than t shares could decrypt this visual information, while nothing would be revealed by any t-1 shares. Particularly, the decryption is performed directly by stacking ...
متن کاملA Recursive Threshold Visual Cryptography Scheme
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of the latter, thereby increasing the efficiency of secret sharing. We present applications of our proposed protocol to images as well as text.
متن کاملAn Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things
Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کامل